Evolutionary Algorithm for School Timetabling
نویسندگان
چکیده
In this paper we describe a method for generating high school timetables using an Evolutionary Algorithm (E.A.) with a new set of genetic operators inspired on the Infected Genes Evolutionary Algorithm (Tavares, 99). We show that widening region of infection considered in (Fernandes, 99) leads to a very significant increase in the performance of the E.A.. Comparative tests between the E.A. with and without the improved Bad-Gene operators were made using the data of a large Portuguese high school. These clearly show that the improved Bad-Gene operators result in a significant improvement in performance.
منابع مشابه
Memetic Algorithms for Timetabling
Course timetabling problems are real world constraint optimization problems that are often coped with in educational institutions, such as universities or high schools. In this paper, we present a variety of new operators that can be also applied in evolutionary algorithms for other timetabling problems, such as, exam timetabling. Operators include violation directed mutations, crossovers, and ...
متن کاملInfected Genes Evolutionary Algorithm for School Timetabling
In this paper we describe a method for generating high school timetables using an Evolutionary Algorithm (E.A.) with a new set of genetic operators inspired on the Infected Genes Evolutionary Algorithm [14]. We show that widening region of infection considered in [7] leads to a very significant increase in the performance of the E.A.. Comparative tests between the E.A. with and without the impr...
متن کاملAn Evolutionary Approach to the School Timetabling Problem
We present a general heuristic technique that solves a timetabling problem, such as school timetabling. It is based on a Hopfield-type neural network, whose complexity was significantly reduced by incorporating a genetic algorithm into a very first stage of the timetabling process. The goal of the GA was to initialize the network so that the number of neurons and their connections decreased, an...
متن کاملA discrete-event optimization framework for mixed-speed train timetabling problem
Railway scheduling is a complex task of rail operators that involves the generation of a conflict-free train timetable. This paper presents a discrete-event simulation-based optimization approach for solving the train timetabling problem to minimize total weighted unplanned stop time in a hybrid single and double track railway networks. The designed simulation model is used as a platform for ge...
متن کاملAutomated Solution of a Highly Constrained School Timetabling Problem - Preliminary Results
This work introduces a highly constrained school timetabling problem which was modeled from the requirements of a German high school. The concept for solving the problem uses a hybrid approach. On the one hand an evolutionary algorithm searches the space of all permutations of the events from which a timetable builder generates the school timetables. Those timetables are further optimized by lo...
متن کاملSuccessful Lecture Timetabling with Evolutionary Algorithms
Arranging a lecture/tutorial/lab timetable in a large university department or school is a hard problem faced continually in educational establishments. We describe how this problem has been solved in one institution via the use of evolutionary algorithms. The technique extends easily and straightforwardly to any lecture timetabling problem. Although there may be more eeective ways to handle pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999